CS 32 CS 32 Lecture 15. Heap Priority queue: queue that allows us to keep a prioritized list of items Insert a new item into the queue Get the value of the highest priority item Remove the highest priority item from the queue For a huge number of pr... CS 32CC CS 32 Lecture 10. STL The STL Vector is a template class like an array with dynamic length. push_back(): add an element at the end of an array How to iterate through link (not just link but other STL containers) An iterator variable is just l... CS 32CC
CS 32 Lecture 15. Heap Priority queue: queue that allows us to keep a prioritized list of items Insert a new item into the queue Get the value of the highest priority item Remove the highest priority item from the queue For a huge number of pr... CS 32CC CS 32 Lecture 10. STL The STL Vector is a template class like an array with dynamic length. push_back(): add an element at the end of an array How to iterate through link (not just link but other STL containers) An iterator variable is just l... CS 32CC